Guessing about Guessing: Practical Strategies for Card Guessing with Feedback

نویسندگان

چکیده

In simple card games, cards are dealt one at a time and the player guesses each sequentially. We study problems where feedback (e.g., correct/incorrect) is given after guess. For decks with repeated values (as in blackjack suits do not matter), optimal strategy differs from “greedy strategy” (of guessing most likely round). Further, both greedy strategies far too complicated for real-time use by human players. Our main results show that heuristics perform close to optimal.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

No-feedback Card Guessing for Dovetail Shuffles

We consider the following problem. A deck of 2n cards labeled consecutively from 1 on top to 2n on bottom is face down on the table. The deck is given k dovetail shuues and placed back on the table, face down. A guesser tries to guess at the cards one at a time, starting from top. The identity of the card guessed at is not revealed, nor is the guesser told whether a particular guess was correct...

متن کامل

Optimal Guessing Strategies in a Quantum Card Game

Three different quantum cards which are non-orthogonal quantum bits are sent to two different players, Alice and Bob, randomly. Alice receives one of the three cards, and Bob receives the remaining two cards. We find that Bob could know better than Alice does on guessing Alice’s card, no matter what Bob chooses to measure his two cards collectively or separately. We also find that Bob’s best st...

متن کامل

Guessing and non-guessing of canonical functions

It is possible to control to a large extent, via semiproper forcing, the parameters (β0, β1) measuring the guessing density of the members of any given antichain of stationary subsets of ω1 (assuming the existence of an inaccessible limit of measurable cardinals). Here, given a pair (β0, β1) of ordinals, we will say that a stationary set S ⊆ ω1 has guessing density (β0, β1) if β0 = γ(S) and β1 ...

متن کامل

A Simple Card Guessing Game Revisited

A deck of cards consisting of m red and n black cards is given. A guess is made as to the colour of the top card, after which it is revealed and discarded. To maximise the number of correct guesses one chooses the colour corresponding to the majority of cards remaining in the deck. We determine the expected number of correct guesses with this strategy, as well as the probability of beating an o...

متن کامل

Knowing about guessing and guessing about knowing: preschoolers' understanding of indeterminacy.

In this article we investigate preschool children's understanding of indeterminacy by examining their ability to distinguish between determinate situations--in which the available evidence eliminates all uncertainty about an outcome--and indeterminate situations--in which it does not. We argue that a full understanding of indeterminacy requires the coordination of 3 processes: search, evaluatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: American Mathematical Monthly

سال: 2022

ISSN: ['1930-0972', '0002-9890']

DOI: https://doi.org/10.1080/00029890.2022.2069986